The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

plus(0, Y) → Y
plus(s(X), Y) → s(plus(X, Y))
min(X, 0) → X
min(s(X), s(Y)) → min(X, Y)
min(min(X, Y), Z) → min(X, plus(Y, Z))
quot(0, s(Y)) → 0
quot(s(X), s(Y)) → s(quot(min(X, Y), s(Y)))

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
min(X, 0') → X
min(s(X), s(Y)) → min(X, Y)
min(min(X, Y), Z) → min(X, plus(Y, Z))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(min(X, Y), s(Y)))

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
min(X, 0') → X
min(s(X), s(Y)) → min(X, Y)
min(min(X, Y), Z) → min(X, plus(Y, Z))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(min(X, Y), s(Y)))

Types:
plus :: 0':s:Z → 0':s:Z → 0':s:Z
0' :: 0':s:Z
s :: 0':s:Z → 0':s:Z
min :: 0':s:Z → 0':s:Z → 0':s:Z
Z :: 0':s:Z
quot :: 0':s:Z → 0':s:Z → 0':s:Z
hole_0':s:Z1_0 :: 0':s:Z
gen_0':s:Z2_0 :: Nat → 0':s:Z

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
plus, min, quot

They will be analysed ascendingly in the following order:
plus < min
min < quot

(6) Obligation:

TRS:
Rules:
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
min(X, 0') → X
min(s(X), s(Y)) → min(X, Y)
min(min(X, Y), Z) → min(X, plus(Y, Z))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(min(X, Y), s(Y)))

Types:
plus :: 0':s:Z → 0':s:Z → 0':s:Z
0' :: 0':s:Z
s :: 0':s:Z → 0':s:Z
min :: 0':s:Z → 0':s:Z → 0':s:Z
Z :: 0':s:Z
quot :: 0':s:Z → 0':s:Z → 0':s:Z
hole_0':s:Z1_0 :: 0':s:Z
gen_0':s:Z2_0 :: Nat → 0':s:Z

Generator Equations:
gen_0':s:Z2_0(0) ⇔ 0'
gen_0':s:Z2_0(+(x, 1)) ⇔ s(gen_0':s:Z2_0(x))

The following defined symbols remain to be analysed:
plus, min, quot

They will be analysed ascendingly in the following order:
plus < min
min < quot

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
plus(gen_0':s:Z2_0(n4_0), gen_0':s:Z2_0(b)) → gen_0':s:Z2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

Induction Base:
plus(gen_0':s:Z2_0(0), gen_0':s:Z2_0(b)) →_R^Ω(1)
gen_0':s:Z2_0(b)

Induction Step:
plus(gen_0':s:Z2_0(+(n4_0, 1)), gen_0':s:Z2_0(b)) →_R^Ω(1)
s(plus(gen_0':s:Z2_0(n4_0), gen_0':s:Z2_0(b))) →_IH
s(gen_0':s:Z2_0(+(b, c5_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

TRS:
Rules:
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
min(X, 0') → X
min(s(X), s(Y)) → min(X, Y)
min(min(X, Y), Z) → min(X, plus(Y, Z))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(min(X, Y), s(Y)))

Types:
plus :: 0':s:Z → 0':s:Z → 0':s:Z
0' :: 0':s:Z
s :: 0':s:Z → 0':s:Z
min :: 0':s:Z → 0':s:Z → 0':s:Z
Z :: 0':s:Z
quot :: 0':s:Z → 0':s:Z → 0':s:Z
hole_0':s:Z1_0 :: 0':s:Z
gen_0':s:Z2_0 :: Nat → 0':s:Z

Lemmas:
plus(gen_0':s:Z2_0(n4_0), gen_0':s:Z2_0(b)) → gen_0':s:Z2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s:Z2_0(0) ⇔ 0'
gen_0':s:Z2_0(+(x, 1)) ⇔ s(gen_0':s:Z2_0(x))

The following defined symbols remain to be analysed:
min, quot

They will be analysed ascendingly in the following order:
min < quot

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
min(gen_0':s:Z2_0(n457_0), gen_0':s:Z2_0(n457_0)) → gen_0':s:Z2_0(0), rt ∈ Ω(1 + n457₀)

Induction Base:
min(gen_0':s:Z2_0(0), gen_0':s:Z2_0(0)) →_R^Ω(1)
gen_0':s:Z2_0(0)

Induction Step:
min(gen_0':s:Z2_0(+(n457_0, 1)), gen_0':s:Z2_0(+(n457_0, 1))) →_R^Ω(1)
min(gen_0':s:Z2_0(n457_0), gen_0':s:Z2_0(n457_0)) →_IH
gen_0':s:Z2_0(0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(11) Complex Obligation (BEST)

(12) Obligation:

TRS:
Rules:
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
min(X, 0') → X
min(s(X), s(Y)) → min(X, Y)
min(min(X, Y), Z) → min(X, plus(Y, Z))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(min(X, Y), s(Y)))

Types:
plus :: 0':s:Z → 0':s:Z → 0':s:Z
0' :: 0':s:Z
s :: 0':s:Z → 0':s:Z
min :: 0':s:Z → 0':s:Z → 0':s:Z
Z :: 0':s:Z
quot :: 0':s:Z → 0':s:Z → 0':s:Z
hole_0':s:Z1_0 :: 0':s:Z
gen_0':s:Z2_0 :: Nat → 0':s:Z

Lemmas:
plus(gen_0':s:Z2_0(n4_0), gen_0':s:Z2_0(b)) → gen_0':s:Z2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)
min(gen_0':s:Z2_0(n457_0), gen_0':s:Z2_0(n457_0)) → gen_0':s:Z2_0(0), rt ∈ Ω(1 + n457₀)

Generator Equations:
gen_0':s:Z2_0(0) ⇔ 0'
gen_0':s:Z2_0(+(x, 1)) ⇔ s(gen_0':s:Z2_0(x))

The following defined symbols remain to be analysed:
quot

(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol quot.

(14) Obligation:

TRS:
Rules:
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
min(X, 0') → X
min(s(X), s(Y)) → min(X, Y)
min(min(X, Y), Z) → min(X, plus(Y, Z))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(min(X, Y), s(Y)))

Types:
plus :: 0':s:Z → 0':s:Z → 0':s:Z
0' :: 0':s:Z
s :: 0':s:Z → 0':s:Z
min :: 0':s:Z → 0':s:Z → 0':s:Z
Z :: 0':s:Z
quot :: 0':s:Z → 0':s:Z → 0':s:Z
hole_0':s:Z1_0 :: 0':s:Z
gen_0':s:Z2_0 :: Nat → 0':s:Z

Lemmas:
plus(gen_0':s:Z2_0(n4_0), gen_0':s:Z2_0(b)) → gen_0':s:Z2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)
min(gen_0':s:Z2_0(n457_0), gen_0':s:Z2_0(n457_0)) → gen_0':s:Z2_0(0), rt ∈ Ω(1 + n457₀)

Generator Equations:
gen_0':s:Z2_0(0) ⇔ 0'
gen_0':s:Z2_0(+(x, 1)) ⇔ s(gen_0':s:Z2_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s:Z2_0(n4_0), gen_0':s:Z2_0(b)) → gen_0':s:Z2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

(16) BOUNDS(n^1, INF)

(17) Obligation:

TRS:
Rules:
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
min(X, 0') → X
min(s(X), s(Y)) → min(X, Y)
min(min(X, Y), Z) → min(X, plus(Y, Z))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(min(X, Y), s(Y)))

Types:
plus :: 0':s:Z → 0':s:Z → 0':s:Z
0' :: 0':s:Z
s :: 0':s:Z → 0':s:Z
min :: 0':s:Z → 0':s:Z → 0':s:Z
Z :: 0':s:Z
quot :: 0':s:Z → 0':s:Z → 0':s:Z
hole_0':s:Z1_0 :: 0':s:Z
gen_0':s:Z2_0 :: Nat → 0':s:Z

Lemmas:
plus(gen_0':s:Z2_0(n4_0), gen_0':s:Z2_0(b)) → gen_0':s:Z2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)
min(gen_0':s:Z2_0(n457_0), gen_0':s:Z2_0(n457_0)) → gen_0':s:Z2_0(0), rt ∈ Ω(1 + n457₀)

Generator Equations:
gen_0':s:Z2_0(0) ⇔ 0'
gen_0':s:Z2_0(+(x, 1)) ⇔ s(gen_0':s:Z2_0(x))

No more defined symbols left to analyse.

(18) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s:Z2_0(n4_0), gen_0':s:Z2_0(b)) → gen_0':s:Z2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

(19) BOUNDS(n^1, INF)

(20) Obligation:

TRS:
Rules:
plus(0', Y) → Y
plus(s(X), Y) → s(plus(X, Y))
min(X, 0') → X
min(s(X), s(Y)) → min(X, Y)
min(min(X, Y), Z) → min(X, plus(Y, Z))
quot(0', s(Y)) → 0'
quot(s(X), s(Y)) → s(quot(min(X, Y), s(Y)))

Types:
plus :: 0':s:Z → 0':s:Z → 0':s:Z
0' :: 0':s:Z
s :: 0':s:Z → 0':s:Z
min :: 0':s:Z → 0':s:Z → 0':s:Z
Z :: 0':s:Z
quot :: 0':s:Z → 0':s:Z → 0':s:Z
hole_0':s:Z1_0 :: 0':s:Z
gen_0':s:Z2_0 :: Nat → 0':s:Z

Lemmas:
plus(gen_0':s:Z2_0(n4_0), gen_0':s:Z2_0(b)) → gen_0':s:Z2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s:Z2_0(0) ⇔ 0'
gen_0':s:Z2_0(+(x, 1)) ⇔ s(gen_0':s:Z2_0(x))

No more defined symbols left to analyse.

(21) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
plus(gen_0':s:Z2_0(n4_0), gen_0':s:Z2_0(b)) → gen_0':s:Z2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

(22) BOUNDS(n^1, INF)